Exploiting Partial Symmetries for Markov Chain Aggregation
نویسندگان
چکیده
The technique presented in this paper allows the automatic construction of a lumped Markov chain for almost symmetrical Stochastic Well-formed Net (SWN) models. The starting point is the Extended Symbolic Reachability Graph (ESRG), which is a reduced representation of a SWN model reachability graph (RG), based on the aggregation of states into classes. These classes may be used as aggregates for lumping the Continuous Time Markov Chain (CTMC) isomorphic to the model RG: however it is not always true that the lumpability condition is verified by this partition of states. In the paper we propose an algorithm that progressively refines the ESRG classes until a lumped Markov chain is obtained.
منابع مشابه
Markov Chain Aggregation for Simple Agent-Based Models on Symmetric Networks: the Voter Model
A general framework of aggregation for the Voter Model (VM) is developed which exploits the symmetries of the agent network G. Depending on the symmetry group Aut(G) of the graph, certain ensembles of agent configurations can be interchanged without affecting the probabilistic structure of the VM. These nodes can be aggregated into the same macro state and the dynamical process projected onto t...
متن کاملFastest Mixing Markov Chain on Graphs with Symmetries
We show how to exploit symmetries of a graph to efficiently compute the fastest mixing Markov chain on the graph (choose the transition probabilities on the edges to minimize the second-largest eigenvalue modulus of the transition probability matrix). Exploiting symmetry can lead to significant reduction in both number of optimization variables and size of matrices in solving the corresponding ...
متن کاملMarkov Chain Aggregation for Simple Agent-based Models on Symmetric Networks: the Voter Model Extended Version Of: Markov Projections of the Voter Model (1209.3902v1)
For Agent Based Models, in particular the Voter Model (VM), a general framework of aggregation is developed which exploits the symmetries of the agent network G. Depending on the symmetry group Autω(N) of the weighted agent network, certain ensembles of agent configurations can be interchanged without affecting the dynamical properties of the VM. These configurations can be aggregated into the ...
متن کاملExploiting symmetries for single- and multi-agent Partially Observable Stochastic Domains
While Partially Observable Markov Decision Processes (POMDPs) and their multiagent extension Partially Observable Stochastic Games (POSGs) provide a natural and systematic approach to modeling sequential decision making problems under uncertainty, the computational complexity with which the solutions are computed is known to be prohibitively expensive. In this paper, we show how such high compu...
متن کاملContextual Symmetries in Probabilistic Graphical Models
An important approach for efficient inference in probabilistic graphical models exploits symmetries among objects in the domain. Symmetric variables (states) are collapsed into meta-variables (metastates) and inference algorithms are run over the lifted graphical model instead of the flat one. Our paper extends existing definitions of symmetry by introducing the novel notion of contextual symme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 39 شماره
صفحات -
تاریخ انتشار 2000